TSTP Solution File: DAT334^12 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : DAT334^12 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:39:08 EDT 2024
% Result : Theorem 0.38s 0.52s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 24
% Syntax : Number of formulae : 40 ( 14 unt; 17 typ; 0 def)
% Number of atoms : 68 ( 8 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 166 ( 12 ~; 9 |; 14 &; 127 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 39 ( 18 ^ 17 !; 4 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_22,type,
mrel: mworld > mworld > $o ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_26,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
eiw_di: $i > mworld > $o ).
thf(decl_34,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_35,type,
cs: $i ).
thf(decl_36,type,
sue: $i ).
thf(decl_37,type,
mary: $i ).
thf(decl_38,type,
john: $i ).
thf(decl_39,type,
math: $i ).
thf(decl_40,type,
psych: $i ).
thf(decl_41,type,
teach: $i > $i > mworld > $o ).
thf(decl_43,type,
esk2_1: mworld > $i ).
thf(decl_44,type,
esk3_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/tmp/tmp.070qkupogO/E---3.1_17137.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.070qkupogO/E---3.1_17137.p',mand_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.070qkupogO/E---3.1_17137.p',mbox_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
? [X6: $i] :
( ( eiw_di @ X6 @ X3 )
& ( X8 @ X6 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.070qkupogO/E---3.1_17137.p',mexists_di_def) ).
thf(db,axiom,
( mlocal
@ ( mbox
@ ( mand @ ( teach @ john @ math )
@ ( mand
@ ( mexists_di
@ ^ [X6: $i] : ( teach @ X6 @ cs ) )
@ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.070qkupogO/E---3.1_17137.p',db) ).
thf(query,conjecture,
( mlocal
@ ( mbox
@ ( mexists_di
@ ^ [X6: $i] : ( teach @ X6 @ cs ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.070qkupogO/E---3.1_17137.p',query) ).
thf(mrel_universal,axiom,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
file('/export/starexec/sandbox/tmp/tmp.070qkupogO/E---3.1_17137.p',mrel_universal) ).
thf(c_0_7,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_8,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_9,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_10,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X6: $i] :
( ( eiw_di @ X6 @ Z1 )
& ( Z0 @ X6 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_11,plain,
! [X14: mworld] :
( ( mrel @ mactual @ X14 )
=> ( ( teach @ john @ math @ X14 )
& ? [X13: $i] :
( ( eiw_di @ X13 @ X14 )
& ( teach @ X13 @ cs @ X14 ) )
& ( teach @ mary @ psych @ X14 )
& ( teach @ sue @ psych @ X14 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[db]),c_0_7]),c_0_8]),c_0_9]),c_0_10]) ).
thf(c_0_12,negated_conjecture,
~ ! [X16: mworld] :
( ( mrel @ mactual @ X16 )
=> ? [X15: $i] :
( ( eiw_di @ X15 @ X16 )
& ( teach @ X15 @ cs @ X16 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query])]),c_0_7]),c_0_9]),c_0_10]) ).
thf(c_0_13,plain,
! [X21: mworld] :
( ( ( teach @ john @ math @ X21 )
| ~ ( mrel @ mactual @ X21 ) )
& ( ( eiw_di @ ( esk2_1 @ X21 ) @ X21 )
| ~ ( mrel @ mactual @ X21 ) )
& ( ( teach @ ( esk2_1 @ X21 ) @ cs @ X21 )
| ~ ( mrel @ mactual @ X21 ) )
& ( ( teach @ mary @ psych @ X21 )
| ~ ( mrel @ mactual @ X21 ) )
& ( ( teach @ sue @ psych @ X21 )
| ~ ( mrel @ mactual @ X21 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
thf(c_0_14,plain,
! [X17: mworld,X18: mworld] : ( mrel @ X17 @ X18 ),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
thf(c_0_15,negated_conjecture,
! [X24: $i] :
( ( mrel @ mactual @ esk3_0 )
& ( ~ ( eiw_di @ X24 @ esk3_0 )
| ~ ( teach @ X24 @ cs @ esk3_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
thf(c_0_16,plain,
! [X3: mworld] :
( ( teach @ ( esk2_1 @ X3 ) @ cs @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,plain,
! [X3: mworld] :
( ( eiw_di @ ( esk2_1 @ X3 ) @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,negated_conjecture,
! [X6: $i] :
( ~ ( eiw_di @ X6 @ esk3_0 )
| ~ ( teach @ X6 @ cs @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,plain,
! [X3: mworld] : ( teach @ ( esk2_1 @ X3 ) @ cs @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
thf(c_0_21,plain,
! [X3: mworld] : ( eiw_di @ ( esk2_1 @ X3 ) @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).
thf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : DAT334^12 : TPTP v8.1.2. Released v8.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n009.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 08:37:10 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.23/0.51 Running higher-order theorem proving
% 0.23/0.51 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.070qkupogO/E---3.1_17137.p
% 0.38/0.52 # Version: 3.1.0-ho
% 0.38/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.38/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.38/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.38/0.52 # Starting almost_fo_3_lam with 300s (1) cores
% 0.38/0.52 # Starting post_as_ho1 with 300s (1) cores
% 0.38/0.52 # ehoh_best2_full_lfho with pid 17292 completed with status 0
% 0.38/0.52 # Result found by ehoh_best2_full_lfho
% 0.38/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.38/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.38/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.38/0.52 # No SInE strategy applied
% 0.38/0.52 # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.38/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.38/0.52 # new_ho_10 with pid 17297 completed with status 0
% 0.38/0.52 # Result found by new_ho_10
% 0.38/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.38/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.38/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.38/0.52 # No SInE strategy applied
% 0.38/0.52 # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.38/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.38/0.52 # Preprocessing time : 0.001 s
% 0.38/0.52 # Presaturation interreduction done
% 0.38/0.52
% 0.38/0.52 # Proof found!
% 0.38/0.52 # SZS status Theorem
% 0.38/0.52 # SZS output start CNFRefutation
% See solution above
% 0.38/0.52 # Parsed axioms : 35
% 0.38/0.52 # Removed by relevancy pruning/SinE : 0
% 0.38/0.52 # Initial clauses : 30
% 0.38/0.52 # Removed in clause preprocessing : 21
% 0.38/0.52 # Initial clauses in saturation : 9
% 0.38/0.52 # Processed clauses : 17
% 0.38/0.52 # ...of these trivial : 0
% 0.38/0.52 # ...subsumed : 0
% 0.38/0.52 # ...remaining for further processing : 17
% 0.38/0.52 # Other redundant clauses eliminated : 0
% 0.38/0.52 # Clauses deleted for lack of memory : 0
% 0.38/0.52 # Backward-subsumed : 0
% 0.38/0.52 # Backward-rewritten : 1
% 0.38/0.52 # Generated clauses : 1
% 0.38/0.52 # ...of the previous two non-redundant : 0
% 0.38/0.52 # ...aggressively subsumed : 0
% 0.38/0.52 # Contextual simplify-reflections : 0
% 0.38/0.52 # Paramodulations : 1
% 0.38/0.52 # Factorizations : 0
% 0.38/0.52 # NegExts : 0
% 0.38/0.52 # Equation resolutions : 0
% 0.38/0.52 # Disequality decompositions : 0
% 0.38/0.52 # Total rewrite steps : 7
% 0.38/0.52 # ...of those cached : 4
% 0.38/0.52 # Propositional unsat checks : 0
% 0.38/0.52 # Propositional check models : 0
% 0.38/0.52 # Propositional check unsatisfiable : 0
% 0.38/0.52 # Propositional clauses : 0
% 0.38/0.52 # Propositional clauses after purity: 0
% 0.38/0.52 # Propositional unsat core size : 0
% 0.38/0.52 # Propositional preprocessing time : 0.000
% 0.38/0.52 # Propositional encoding time : 0.000
% 0.38/0.52 # Propositional solver time : 0.000
% 0.38/0.52 # Success case prop preproc time : 0.000
% 0.38/0.52 # Success case prop encoding time : 0.000
% 0.38/0.52 # Success case prop solver time : 0.000
% 0.38/0.52 # Current number of processed clauses : 8
% 0.38/0.52 # Positive orientable unit clauses : 7
% 0.38/0.52 # Positive unorientable unit clauses: 0
% 0.38/0.52 # Negative unit clauses : 0
% 0.38/0.52 # Non-unit-clauses : 1
% 0.38/0.52 # Current number of unprocessed clauses: 0
% 0.38/0.52 # ...number of literals in the above : 0
% 0.38/0.52 # Current number of archived formulas : 0
% 0.38/0.52 # Current number of archived clauses : 9
% 0.38/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.38/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.38/0.52 # Non-unit clause-clause subsumptions : 0
% 0.38/0.52 # Unit Clause-clause subsumption calls : 0
% 0.38/0.52 # Rewrite failures with RHS unbound : 0
% 0.38/0.52 # BW rewrite match attempts : 1
% 0.38/0.52 # BW rewrite match successes : 1
% 0.38/0.52 # Condensation attempts : 17
% 0.38/0.52 # Condensation successes : 0
% 0.38/0.52 # Termbank termtop insertions : 1228
% 0.38/0.52 # Search garbage collected termcells : 226
% 0.38/0.52
% 0.38/0.52 # -------------------------------------------------
% 0.38/0.52 # User time : 0.005 s
% 0.38/0.52 # System time : 0.001 s
% 0.38/0.52 # Total time : 0.006 s
% 0.38/0.52 # Maximum resident set size: 1704 pages
% 0.38/0.52
% 0.38/0.52 # -------------------------------------------------
% 0.38/0.52 # User time : 0.008 s
% 0.38/0.52 # System time : 0.002 s
% 0.38/0.52 # Total time : 0.010 s
% 0.38/0.52 # Maximum resident set size: 1756 pages
% 0.38/0.52 % E---3.1 exiting
% 0.38/0.52 % E exiting
%------------------------------------------------------------------------------